Simplifying the vacuum bazooka

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simplifying triangulations

We give a new algorithm to simplify a given triangulation with respect to a given curve. The simplification uses flips together with powers of Dehn twists in order to complete in polynomial time in the bit-size of the curve. keywords. triangulations of surfaces, flip graphs, Dehn twists Mathematics Subject Classification (2010): 57M20

متن کامل

Simplifying the DevOps Adoption Process

DevOps is a new tendency in business and information technology alignment. The purpose of DevOps is bridging the gap between the development and operations. Several sources claim that DevOps is a new style of work. Many successful DevOps introduction attempts and also many problems in adoption of this style of work have been discussed. This paper reports on research results in facilitating the ...

متن کامل

Simplifying the Direct Submission process.

Although the largest number of submissions to PNAS are through the Direct Submission route, there continues to linger a general perception that to publish a paper in PNAS, an author requires sponsorship of an NAS member. In July 2010, the member Communicated route was eliminated, but to ensure and promote submission of exceptional papers that either were interdisciplinary and hence needed speci...

متن کامل

Simplifying CRISPR

eveloping cell lines for use as accurate models for disease has always been a challenging task. In order to replicate phenotypes or enable downstream experimentation, genome engineering of cell lines is required. Techniques enabling genome modification have evolved over a number of years, from simple viral vectors used to insert sequences in random locations, to more sophisticated methods that ...

متن کامل

Simplifying Parallel List Traversal Simplifying Parallel List Traversal

Computations described using Bird's constructive algebra of lists are nicely amenable to parallel implementation. Indeed , by using higher-order functions, ordered list traversals such as foldl and foldr can be expressed as unordered reductions. Based on this observation, a set of optimizations have been developed for list traversals in the parallel Haskell (pH) compilerr12]. These optimization...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physics Education

سال: 2019

ISSN: 0031-9120,1361-6552

DOI: 10.1088/1361-6552/ab08f1